Compaction for two models of logarithmic‐depth trees: Analysis and experiments

We are interested in the quantitative analysis of compaction ratio for two classical families trees: recursive trees and plane binary increasing trees. These typical representatives tree models with a small depth. Once size n is compacted by keeping only one occurrence all fringe subtrees appearing resulting graph contains nodes. This result must be compared to results simply generated trees, where analogous states that structure order . The about has already been proved, but we propose new generic approach get result. Finally, an experimental study presented, based on prototype implementation search modeled